Queueing Systems with a Removable Service Station
نویسندگان
چکیده
A single server queueing system 'With constant Poisson input is considered and the partiel elimination of the station's idle fraction is envisaged by intermittent close-do'Wn and setup. The rule pertaining to the dismantling and re-establishing of the service staticn-the management doctrine-is based on the instantaneous size of the queue, but these processes are assumed to consume time. Operating characteristics of such systems-in particular, average queue length and queueing time-are evaluated. A cost structure is superimposed on the system and optimisation procedures are outlined. The close relationship with a) priority queueing and b) storage models is pointed out.
منابع مشابه
Multi-Objective Lead Time Control in Multistage Assembly Systems (TECHNICAL NOTE)
In this paper we develop a multi-objective model to optimally control the lead time of a multistage assembly system. The multistage assembly system is modeled as an open queueing network, whose service stations represent manufacturing or assembly operations. The arrival processes of the individual parts of the product, which should be assembled to each other in assembly stations, are assumed to...
متن کاملOptimal management of the N-policy M/Ek/1 queuing system with a removable service station: a sensitivity investigation
This paper deals with optimal management problem of the N -policy M=Ek=1 queuing system with a removable service station under steady-state condition. The server is in a controllable position that the manager can turn the single server on at any arrival epoch, or o. at any service completion. Arrival time and service time of the customers are assumed to follow the negative exponential distribut...
متن کاملComparative analysis for the N policy M/G/1 queueing system with a removable and unreliable server
In this paper we analyze a single removable and unreliable server in the N policy M/G/1 queueing system in which the server breaks down according to a Poisson process and the repair time obeys an arbitrary distribution. The method of maximum entropy is used to develop the approximate steady-state probability distributions of the queue length in the M/G(G)/1 queueing system, where the second and...
متن کاملAnalysis of an M/G/1 Queue with Multiple Vacations, N-policy, Unreliable Service Station and Repair Facility Failures
This paper studies an M/G/1 repairable queueing system with multiple vacations and N-policy, in which the service station is subject to occasional random breakdowns. When the service station breaks down, it is repaired by a repair facility. Moreover, the repair facility may fail during the repair period of the service station. The failed repair facility resumes repair after completion of its re...
متن کاملFuzzy Hierarchical Location-Allocation Models for Congested Systems
There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...
متن کامل